Essential Forcing Generics
نویسندگان
چکیده
We use model theoretic forcing to study and generalize the construction of (K ,≤)-generic models introduced by Kueker and Laskowski. We characterize the (K ,≤)-generic models in terms of forcing and introduce a more general class of models, called essential forcing generics, which have many of the same properties.
منابع مشابه
On Mathias Generic Sets
We present some results about generics for computable Mathias forcing. The n-generics and weak n-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing relation, and show that if G is any n-generic with n ≥ 3 then it satisfies the jump property G(n−1) = G′ ⊕ ∅(n). We prove that every such G has generalized high degree, ...
متن کاملGenerics for computable Mathias forcing
We study the complexity of generic reals for computable Mathias forcing in the context of computability theory. The n-generics and weak ngenerics form a strict hierarchy under Turing reducibility, as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing relation, and show that if G is any n-generic with n ≥ 3 then it satisfies the jump property G(n−1) ≡T G′ ⊕ ∅(n). We p...
متن کاملPreserving Non–Null with Suslin proper forcings
We (i.e. I) present a simplified version of Shelah’s “preserving a little implies preserving much”: If I is the ideal generated by a Suslin ccc forcing (e.g. Lesbeque– null or meager), and P is a Suslin forcing, and P is I–preserving (i.e. it doesn’t make any positive Borel–set small), then P preserves generics over candidates and therefore is strongly I–preserving (i.e. doesn’t make any positi...
متن کاملSaccharinity
A. We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals measurable with respect to a certain (non-ccc) ideal. 1. I In the seminal paper [10] Solovay proved that in the Levy model (after collap...
متن کاملPreserving Non-null with Suslin+ Forcings
We (i.e. I) present a simplified version of Shelah’s “preserving a little implies preserving much”: If I is the ideal generated by a Suslin ccc forcing (e.g. Lebesque– null or meager), and P is a Suslin forcing, and P is I–preserving (i.e. it doesn’t make any positive Borel–set small), then P preserves generics over candidates and therefore is strongly I–preserving (i.e. doesn’t make any positi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 41 شماره
صفحات -
تاریخ انتشار 2000